Complexity classes - PDFSEARCH.IO - Document Search Engine

Complexity classes
Results: 1120

#	Item
151	On Decision Procedures for Ordered Collections Add to Reading List Source URL: lara.epfl.ch Language: English - Date: 2010-02-08 11:12:45 Elementary mathematics Cardinal numbers Boolean algebra Mathematical optimization Integer Finite set NP Cardinality Boolean satisfiability problem Mathematics Theoretical computer science Complexity classes
152	Some issues related to double roundings Erik Martin-Dorel1 Guillaume Melquiond2 1 ENS Add to Reading List Source URL: perso.ens-lyon.fr Language: English - Date: 2012-06-15 04:50:15 Complexity classes Applied mathematics Arithmetic Rounding Floating point IEEE 754-2008 FP Algorithm P Theoretical computer science Mathematics Computer arithmetic
153	An Improved Algorithm for Computing Roadmaps of Algebraic Sets Saugata Basu Purdue University Add to Reading List Source URL: iros2011.org Language: English - Date: 2011-09-21 06:59:57 P Mathematics Cylindrical algebraic decomposition Complexity classes NP Polynomial
154	Towards a Complexity Theory for Local Distributed Computing⇤ Pierre Fraigniaud† Amos Korman† Add to Reading List Source URL: www.liafa.jussieu.fr Language: English - Date: 2013-08-21 13:35:48 NP-complete problems Graph coloring Graph theory Analysis of algorithms Complexity classes Randomized algorithm Distributed computing Minimum spanning tree SL Theoretical computer science Computational complexity theory Mathematics
155	Towards Efficient Satisfiability Checking for Boolean Algebra with Presburger Arithmetic Viktor Kuncak1 and Martin Rinard2 1 Ecole Politechnique F´ed´erale de Lausanne, Lausanne, VD, Switzerland Add to Reading List Source URL: lara.epfl.ch Language: English - Date: 2007-12-05 11:59:40 Logic in computer science Model theory Complexity classes Boolean algebra Electronic design automation Boolean satisfiability problem Presburger arithmetic Quantifier elimination Decision problem Theoretical computer science Computational complexity theory Applied mathematics
156	An Improved Algorithm for Computing Roadmaps of Algebraic Sets Saugata Basu Purdue University Add to Reading List Source URL: www.cse.unr.edu Language: English - Date: 2012-12-20 19:29:22 P Mathematics Cylindrical algebraic decomposition Complexity classes NP Polynomial
157	2013 Results by Poolpdf Add to Reading List Source URL: ohiohome.org Language: English - Date: 2013-06-12 08:05:20 Public housing Complexity classes FP NP
158	Chapter 1 Introduction Let f be Boolean function from nite binary strings to the set f0; 1g. The basic question of complexity theory is what computational resources are needed to compute f (x) for an arbitrary n-bit str Add to Reading List Source URL: www.nada.kth.se Language: English - Date: 2011-01-05 06:16:54 Circuit complexity Complexity classes Parity function ACC0 Switching lemma NC Clique problem Boolean circuit Circuit Theoretical computer science Computational complexity theory Applied mathematics
159	MATH 216 PROBLEM SET 11 This set is due by noon on Monday, January 30. Hand in your homework to me by email. Please read all of the problems, and ask me about any statements that you are unsure of, even of the many prob Add to Reading List Source URL: math.stanford.edu Language: English - Date: 2012-01-17 18:09:28 Applied mathematics Mathematical optimization Conjectures Mathematics Chess problem Problem Complexity classes
160	JMLR: Workshop and Conference Proceedings 34:33–48, 2014 Proceedings of the 12th ICGI A Canonical Semi-Deterministic Transducer Achilles Beros Add to Reading List Source URL: jmlr.org Language: English - Date: 2014-08-26 06:56:50 Complexity classes Models of computation Order theory Automata theory Integer sequences Antichain Finite-state machine FO Function Theoretical computer science Mathematics Applied mathematics

UPDATE